Permissive multi-strategies in timed games

نویسندگان

  • Erwin Fang
  • Nicolas Markey
چکیده

This report deals with non-deterministic timed strategies, also called timed multi-strategies, for two-player games played between a controller and the environment on the structure of a timed automaton. The motivation of the concept of multi-strategies in timed systems is to have a certain flexibility of which action to be executed. We introduce a penalty for the controller as a quantitative measure for permissiveness of such strategies. Hereby, the aim is to prevent punctual timed requirements that are not realistic for practical controller-synthesis since realtime systems are subject to perturbation and imprecision of time. We present a game on two slightly different settings with a reachability objective. The aim of the controller is to keep the penalty as low as possible. We propose a fixed point computation for computing the optimal penalty for the controller and show that the most permissive timed multi-strategy for timed automata with one clock is computable in polynomial time. For the general case, we show that the most permissive strategy exists and that memoryless strategies are sufficient. Acknowledgements I would like to express my deepest gratitude to my supervisors Patricia Bouyer-Decitre and Nicolas Markey. They managed to inspire me to the research topic during the class about foundations of real-time systems verification and throughout the internship. I am very thankful for all the fruitful discussions with Patricia and Nicolas. Especially, I want to thank Nicolas for proofreading the report and his generous support throughout the whole internship. Moreover, I am very grateful to have got the opportunity to take part in several scientific meetings and events through the Casting project and LSV. This internship was my greatest research experience so far. Thank you very much Patricia and Nicolas! ∗Ce rapport est rédigé en anglais parce que la connaissance du français de l’auteur n’est pas suffisante.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Electronic Communications of the EASST Volume 72 ( 2015 ) Proceedings of the 15 th International Workshop on Automated Verification of Critical Systems ( AVoCS 2015 ) Permissive strategies in timed automata and games 1

Timed automata are a convenient framework for modelling and reasoning about real-time systems. While these models are now well-understood, they do not offer a convenient way of taking timing imprecisions into account. Several solutions (e.g. parametric guard enlargement) have been proposed over the last ten years to take such imprecisions into account. In this paper, we propose a novel approach...

متن کامل

Permissive strategies in timed automata and games

Timed automata are a convenient framework for modelling and reasoning about real-time systems. While these models are now well-understood, they do not offer a convenient way of taking timing imprecisions into account. Several solutions (e.g. parametric guard enlargement) have been proposed over the last ten years to take such imprecisions into account. In this paper, we propose a novel approach...

متن کامل

Almost Optimal Strategies in One Clock Priced Timed Games

We consider timed games extended with cost information, and prove computability of the optimal cost and of ε-optimal memoryless strategies in timed games with one clock. In contrast, this problem has recently been proved undecidable for timed games with three clocks.

متن کامل

Trading Infinite Memory for Uniform Randomness in Timed Games

We consider concurrent two-player timed automaton games with ω-regular objectives specified as parity conditions. These games offer an appropriate model for the synthesis of real-time controllers. Earlier works on timed games focused on pure strategies for each player. We study, for the first time, the use of randomized strategies in such games. While pure (i.e., nonrandomized) strategies in ti...

متن کامل

Admissible Strategies in Timed Games

In this paper, we study the notion of admissibility in timed games. First, we show that admissible strategies may not exist in timed games with a continuous semantics of time, even for safety objectives. Second, we show that the discrete time semantics of timed games is better behaved w.r.t. admissibility: the existence of admissible strategies is guaranteed in that semantics. Third, we provide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014